Perturbing the shortest path on a critical directed square lattice
نویسندگان
چکیده
منابع مشابه
Jamming of directed traffic on a square lattice
Phase transition from a free-flow phase to a jammed phase is an important feature of traffic networks. We study this transition in the case of a simple square lattice network for different values of data posting rate (ρ) by introducing a parameter p which selects a neighbour for onward data transfer depending on queued traffic. For every ρ there is a critical value of p above which the system b...
متن کاملTemporally Disordered Bond Percolation on the Directed Square Lattice.
Simple models of directed bond percolation with temporal disorder are introduced and studied via series expansions and Monte Carlo simulations. Series have been derived for the percolation probability on the directed square lattice. Analysis of the series revealed that the critical exponent b and critical point pc change continuously with the strength of the disorder. Monte Carlo simulation con...
متن کاملFoundations and the critical point on the square lattice
1 distance ku vk is 1. For brevity, we will also write uv instead of {u, v} for the edge between u and v (note that uv = vu). The boundary @G of G is the set of those vertices u in V for which there is a v 2 Z2 \ V with ku vk = 1. We associate to G a space of spin configurations ⌦G = { 1,+1}V . For 2 ⌦G , v denotes the spin at v. Sometimes we impose positive boundary conditions, meaning that we...
متن کاملCritical Ising on the Square Lattice Mixes in Polynomial Time
The Ising model is widely regarded as the most studied model of spin-systems in statistical physics. The focus of this paper is its dynamic (stochastic) version, the Glauber dynamics, introduced in 1963 and by now the most popular means of sampling the Ising measure. Intensive study throughout the last three decades has yielded a rigorous understanding of the spectral-gap of the dynamics on Z e...
متن کاملA Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
This thesis introduces a new acceleration heuristic for shortest path queries, called the PCD algorithm (Precomputed Cluster Distances). PCD precomputes shortest path distances between the partitions of the input graph, which can be obtained by any graph partitioning method. Since the number of partitions can be varied between one and the number of nodes, the method presents an interpolation be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2018
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.98.052143